Regularity of BPP is PSPACE-complete
نویسنده
چکیده
Jančar has in 2003 shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. But bisimilarity is studied also on various subclasses of BPP. We present summary of known complexity bounds of some such bisimilarity problems. Moreover is here shown that deciding regularity of a BPP is PSPACE-complete. This result was presented at winter school Movep’04 in PhD students section.
منابع مشابه
Some problems related to bisimilarity on BPP
Jančar has in 2003 shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. Bisimilarity is studied on various subclasses of BPP as well. We present summary of known complexity bounds of some such bisimilarity problems. Moreover is here shown that deciding regularity of a BPP is PSPACE-complete. So far this problem was only known to be PSPACE-hard.
متن کاملStrong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
We show that the problem of checking whether two processes definable in the syntax of Basic Parallel Processes (BPP) are strongly bisimilar is PSPACE-hard. We also demonstrate that there is a polynomial time reduction from the strong bisimilarity checking problem of regular BPP to the strong regularity (finiteness) checking of BPP. This implies that strong regularity of BPP is also PSPACE-hard.
متن کاملComplexity Of Weak Bisimilarity And Regularity For Bpa And Bpp
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound for BPP have been demonstrated by Stribrna. Mayr achieved recently a result, saying that weak bisimilarity for BPP is Π2 -hard. We improve this lower bound to PSPACE, moreover for the restricted class of normed BPP. Weak...
متن کاملSimulation Preorder on Simple Process Algebras
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simulation equivalence are intractable between all major classes of infinite-state systems and finite-state ones. This result is obtained by showing that the problem whether a BPA (or BPP) process simulates a finitestate on...
متن کاملComplexity of Checking Bisimilarity between Sequential and Parallel Processes
Decidability of bisimilarity for Process Algebra (PA) processes, arising by mixing sequential and parallel composition, is a longstanding open problem. The known results for subclasses contain the decidability of bisimilarity between basic sequential (i.e. BPA) processes and basic parallel processes (BPP). Here we revisit this subcase and derive an exponential-time upper bound. Moreover, we sho...
متن کامل